Daniel Meneveaux , Eric Maisel and Kadi Bouatouch
نویسندگان
چکیده
Computing global illumination in a moderate time for complex environments and walking through them is one of the challenges in computer graphics. To meet this goal, a prepro-cessing is necessary. This preprocessing consists in partitioning the environment into cells and determining visibility between these cells. Most of the existing partitioning methods rely on the Binary Space Partitioning technique (BSP) which can be easily applied to axial environments. But for non axial scenes the BSP has an important complexity of O(n 3) in time to construct a tree of size at worst O(n 2), n beeing the total number of input polygons. Moreover this technique entails a too important number of cells which do not necessarily t with the topology of the environment. We propose in this paper a model-based partitioning method which can be applied to non axial buildings. It results in a few number of cells tting at best with the environment topology. The problem of visibilty calculation is not addressed in this paper. Nouvelle Technique de Structuration de Sc enes Architecturales R esum e : EEectuer des calculs d'illumination globale pour des environnements complexes et les visualiser de mani ere interactive demeure un probl eme diicile en synth ese d'image. Pour atteindre ce but, une etape de pr ecalcul est n ecessaire. Ce pr ecalcul consiste a structu-rer la sc ene en cellules et a evaluer les relations de visibilit e entre ces derni eres. La plupart des m ethodes de structuration existantes reposent sur une technique de subdivision binaire de l'espace (BSP ou Binary Space Partitioning), facilement applicable a des environnements axiaux. En revanche, pour des sc enes non axiales, la subdivision binaire a une complexit e importante : O(n 3) pour construire des arbres de taille de l'odre de O(n 2), n etant le nombre de polygones initiaux. De plus, cette technique entra^ ne un nombre de cellules trop important , ne correspondant souvent pas a la topologie de l'environnement. Dans ce rapport, nous proposons une nouvelle m ethode de structuration pouvant ^ etre appliqu ee a des b^ atiments non axiaux. Le r esultat de cette structuration produit un nombre r eduit de cellules, respec-tant au mieux la topologie de l'environnement. Les probl emes li es aux calculs de visibilit e ne sont pas evoqu es dans ce rapport.
منابع مشابه
Memory Management Schemes for Radiosity Computation in Complex Environments Daniel Meneveaux, Kadi Bouatouch and Eric Maisel
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...
متن کاملThèse / Université De Rennes 1 Ecole Doctorale Matisse Virtual Camera Control Using Dynamic Spatial Partitions Rémi Ronfard Résumé En Français Résumé De Nos Contributions Une Approche Efficace Du Contrôle D'une Caméra Virtuelle : L'espace Torique
176 vii te l-0 09 16 83 5, v er si on 1 10 D ec 2 01 3
متن کاملSimulation of the indoor propagation of a 60 GHz electromagnetic wave with a time-dependent radiosity algorithm
متن کامل
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...
متن کاملParallel Radiosity Using a Shared Virtual Memory
The radiosity method is a very demanding process in terms of computing and memory resources. To cope with these problems, parallel solutions have been proposed in the literature. These solutions are outlined and classiied in this paper. A new parallel solution, based on the use of a shared virtual memory (SVM), is proposed. It will be shown that this concept of SVM greatly simpliies the impleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007